cyclic structure meaning in English
环状结构
Examples
- Mark - sweep is simple to implement , can reclaim cyclic structures easily , and doesn t place any burden on the compiler or mutator like reference counting does
标记-清除实现起来很简单，可以容易地回收循环的结构，并且不像引用计数那样增加编译器或者赋值函数的负担。 - In this paper , we disscuss the problem on cyclic structure of graphs . we provide three sufficient conditions on the existence of long cycles passing through a specified vertex , a specified edge in unweighted graphs , and three sufficient conditions on the existence of heavy cycles in weighted graph
本文主要研究了非赋权图及赋权图的圈性结构问题，给出了非赋权图过指定点、指定边长圈存在的三个充分条件，并且还给出了赋权图重圈存在的三个充分条件 - Reference counting is simple , lends itself well to incremental collection , and the collection process tends to have good locality of reference , but it is rarely used in production garbage collectors for a number of reasons , such as its inability to reclaim unreachable cyclic structures objects that reference each other directly or indirectly , like a circularly linked list or a tree that contains back - pointers to the parent node
引用计数很简单，很适用于增量收集，收集过程一般会得到好的引用区域性，但是出于几个理由，它很少在生产垃圾收集器中使用，如它不能回收不可到达的循环结构（彼此直接或者间接引用的几个对象，如循环链接的列表或者包含指向父节点的反向指针的树） 。